A Van Benthem Theorem for Modal Team Semantics
نویسندگان
چکیده
The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework of modal dependence logic MDL and team semantics. We show that modal team logic MTL, extending MDL by classical negation, captures exactly the FO-definable bisimulation invariant properties of Kripke structures and teams. We also compare the expressive power of MTL to most of the variants and extensions of MDL recently studied in the area. 1998 ACM Subject Classification F.4.1 [Mathematical Logic] Modal Logic
منابع مشابه
Evidence Logic: A New Look at Neighborhood Structures
Two of the authors (van Benthem and Pacuit) recently introduced evidence logic as a way to model epistemic agents faced with possibly contradictory evidence from different sources. For this the authors used neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N . A normal belief modality is defined in terms of the...
متن کاملA van Benthem Theorem for Fuzzy Modal Logic
We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes propositional modal logic as the bisimulation-invariant fragment of first-order logic. Specifically, we consider a first-order fuzzy predicate logic alongwith its modal fragment, and show that the fuzzy first-order formulas that are non-expansive w.r.t. the natural notion of bisimulation distance are ex...
متن کاملSahlqvist Correspondence for Modal mu-calculus
We define analogues of modal Sahlqvist formulas for the modal mucalculus, and prove a correspondence theorem for them.
متن کاملfor modal mu - calculus
We define analogues of modal Sahlqvist formulas for the modal mu-calculus, and prove a correspondence theorem for them.
متن کاملAGM Belief Revision in Monotone Modal Logics
Classical modal logics, based on the neighborhood semantics of Scott and Montague, provide a generalization of the familiar normal systems based on Kripke semantics. This paper defines AGM revision operators on several first-order monotonic modal correspondents, where each first-order correspondence language is defined by Marc Pauly’s version of the van Benthem characterization theorem for mono...
متن کامل